An Improved Evolution Strategy Hybridization With Simulated Annealing for Permutation Flow Shop Scheduling Problems

نویسندگان

چکیده

Flow Shop Scheduling Problem (FSSP) has significant application in the industry, and therefore it been extensively addressed literature using different optimization techniques. Current research investigates Permutation (PFSSP) to minimize makespan Hybrid Evolution Strategy (HES SA ). Initially, a global search of solution space is performed an Improved (I.E.S.), then improved by utilizing local abilities Simulated Annealing (S.A.). I.E.S. thoroughly exploits reproduction operator, which four offsprings are generated from one parent. A double swap mutation used guide more promising areas less computational time. The rate also varied for fine-tuning results. best acts as seed S.A., further results exploring better neighborhood solutions. In insertion used, cooling parameter acceptance-rejection criteria induce randomness algorithm. proposed HES algorithm tested on well-known NP-hard benchmark problems Taillard (120 instances), performance compared with famous techniques available literature. Experimental indicate that finds fifty-four upper bounds instances, while thirty-eight instances.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling

Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...

متن کامل

Optimizing Bicriteria Flow Shop Scheduling Problem By Simulated Annealing Algorithm

We consider the flow shop scheduling problem with minimizing two criteria simultaneously: the total completion time (makespan) and the sum of tardiness of jobs. The problem is strongly NP-hard, since for each separate criteria the problem is strongly NP-hard. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but usage of those heuristics to...

متن کامل

Multi-objective flow shop scheduling using hybrid simulated annealing

Purpose – In order to achieve excellence in manufacturing, goals like lean, economic and quality production with enhanced productivity play a crucial role in this competitive environment. It also necessitates major improvements in generally three primary technical areas: variation reduction, equipment reliability, and production scheduling. Complexity of the real world scheduling problems also ...

متن کامل

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3093336